1809C - Sum on Subarrays - CodeForces Solution

#include<bits/stdc++.h>
using namespace std;
int main(){
	int t, n, m, k;
	scanf("%d\n", &t);
	while(t--){
		scanf("%d%d", &n, &k);
		m = (int)ceil(sqrt(2*k));
		if(m && m*(m-1)/2>=k)m--;
		for(int i = 1; i < m; i++){
		    printf("2 ");
		}
		if(m != 0 && m <= n){
		    printf("%d ", 1 + 2 * k - m*(m+1));
		}
		for(int i = 0; i < n - m; i++){
		    printf("-1000 ");
		}
		printf("\n");
	}
}